Harmonic Centrality and Centralization of Some Graph Products

Harmonic centrality calculates the importance of a node in network by adding inverse geodesic distances this to all other nodes. centralization, on hand, is graph-level score based node-level harmonic centrality. In paper, we present some results both and centralization graphs resulting from graph products such as Cartesian direct path $P_2$ with any $P_m$, cycle $C_m$, fan $F_m$ graphs.